Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
نویسندگان
چکیده
منابع مشابه
Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
This work was carried out in collaboration between both authors. Author KP designed the study, wrote the protocol and supervised the work. Authors KP and ZG carried out all laboratories work and performed the statistical analysis. Author KP managed the analyses of the study. Author KP wrote the first draft of the manuscript. Author ZG managed the literature searches and edited the manuscript. B...
متن کاملHybrid CP+LNS for the Curriculum-Based Course Timetabling Problem
Course Timetabling (CTT) [11] is a popular combinatorial optimization problem, which deals with generating university timetables by scheduling weekly lectures, subject to conflicts and availability constraints, while minimizing costs related to resources and user discomfort. In CB-CTT, students enrol to curricula i.e., (possibly overlapping) collections of courses. Lectures of courses pertainin...
متن کاملSAT Model for the Curriculum-Based Course Timetabling Problem
Two widely used problems are the Satisfiability problem (SAT) and the Curriculum-Based Course Timetabling (CB-CTT) problem. The SAT problem searches for an assignment that make true a certain boolean formula. On the other side, the CB-CTT involves the task of scheduling lectures of courses to rooms, considering teacher availability, a specified curricula, and a set of constraints. Given the adv...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the post enrolment course timetabling problem by ant colony optimization
In this work we present a new approach to tackle the problem of Post Enrolment Course Timetabling as specified for the International Timetabling Competition 2007 (ITC2007), competition track 2. The heuristic procedure is based on Ant Colony Optimization (ACO) where artificial ants successively construct solutions based on pheromones (stigmergy) and local information. The key feature of our algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: British Journal of Mathematics & Computer Science
سال: 2016
ISSN: 2231-0851
DOI: 10.9734/bjmcs/2016/23143